Auto-Recoverable Cryptosystems with Faster Initialization and the Escrow Hierarchy
نویسندگان
چکیده
In this paper we present a new Auto-Recoverable AutoCertifiable Cryptosystem that is based on an algebraic problem different from the original system (of Eurocrypt’98). Specifically, our new cryptosystem uses generalized ElGamal and RSA. It has the following new advantages: (1) the escrow authority’s key can be set-up much faster than in the original scheme; and (2) It can be used to implement the notion we introduce here of what we call “escrow hierarchy.”
منابع مشابه
RSA-Based Auto-recoverable Cryptosystems
The deployment of a “public-key infrastructure” (PKI) has recently started. Another recent concern in business and on the national level is the issue of escrowed encryption, key recovery, and emergency access to information (e.g., in the medical record area). Independent development of a PKI and an escrowed PKI (whenever required or desired) will pose a lot of constraints, duplication efforts a...
متن کاملSelf-Escrowed Public-Key Infrastructures
This paper introduces a cryptographic paradigm called selfescrowed encryption, a concept initiated by kleptography. In simple words, a self-escrowed public-key cryptosystem features the property that the scheme’s public and private keys are connected to each other by the mean of an other cryptosystem, called the master scheme. We apply this notion to the design of auto-recoverable autocertifiab...
متن کاملSecure and Efficient Threshold Key Issuing Protocol for ID-based Cryptosystems
Key issuing protocols deal with overcoming the two inherent problems: key escrow and secure channel requirement of the identity based cryptosystems. An efficient key issuing protocol enables the identity based cryptosystems to be more acceptable and applicable in the real world. We present a secure and efficient threshold key issuing protocol. In our protocol, neither KGC nor KPA can impersonat...
متن کاملSignatures in hierarchical certificateless cryptography: Efficient constructions and provable security
Recent years, lots of efforts have been devoted to construct secure schemes in certificateless cryptography which eliminates the key escrow problem in identity-based cryptography. However, most of them are designed in traditional certificateless cryptography which suffers from the single-point problem. Hierarchical cryptography exploits a practical security model to mirror the organizational hi...
متن کاملEfficient Identity Based Parameter Selection for Elliptic Curve Cryptosystems
A method is proposed that allows each individual party to an elliptic curve cryptosystem to quickly determine its own unique pair of finite field and Weierstraß equation, in such a way that the resulting pair provides adequate security. Although the choice of Weierstraß equations allowed by this proposal is limited, the number of possible finite fields is unlimited. The proposed method allows e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999